‘Progress’ is a dazzling concept used to describe developments in all areas of life. Progress is of particular interest in the sciences, where it manifests itself in innovations in the natural sciences and technology, for example. Whether one trusts in progress and looks hopefully into the future or longs for a golden past and distrusts progress depends on the observer. Modern science cannot be separated from the hope for progress and new knowledge. In this book, examples from different sciences are (...) used to look at progress in those fields. In addition, the scientific environment, in the form of the communication and promotion of science, is also taken into account. With contributions by Prof. Dr. Thomas Heinemann, Prof. Dr. Gregor Maria Hoff, Prof. Dr. Wim Kösters, Prof. Dr. Ulrich Lüke, Prof. Dr. Gregor Nickel, Prof. Dr. Thomas Schmidt, Prof. Dr. Jörg Siekmann, Prof. Dr. Manfred Stöckler and Dr. Eva-Maria Streier. (shrink)

Auch als originar politischer Denker ist Karl Jaspers reich an Einsichten: Ausgehend vom Ethos der Freiheit jedes Einzelnen richtet er seinen Blick auf die konkrete politische Gestaltung einer Freiheitsordnung. Dabei steht fur ihn im Hinblick auf die noch junge Bundesrepublik die Selbsterziehung in Freiheit im Zentrum seiner oft mahnenden Worte. Ganz im sokratischen Sinne fordert er intellektuelle Redlichkeit und politische Wahrhaftigkeit ein, um den beiden grossen Gegenwartsherausforderungen gewachsen zu sein: einer atomwaffenbestuckten Welt, die sich jederzeit selbst ausloschen kann, und (...) dem modernen Totalitarismus, der in seiner Verherrlichung des Antipolitischen allen politischen Ordnungsbestrebungen die Vernichtung androht. Jeder Frieden, der mehr ist als die Friedhofsruhe eines Waffenstillstands, grundet fur Jaspers in der politischen Freiheit handelnder Burgerinnen und Burger, die gemeinsam Sorge fur die Integritat ihres politischen Gemeinwesens tragen. Mit Beitragen von Karl-Heinz Breier, Alexander Gantschow, Anton Hugli, Annabelle Petschow, Kurt Salamun, Reinhard Schulz, Bernhard Sutor, Bernd Weidmann. (shrink)

Um eine globale Dimension zu gewinnen, muss moderne Geschichtswissenschaft theoriefähig sein. Das hier vorgeschlagene Konzept einer Historie, die sich zur Theorie hin weitet, entspricht einem neuen Paradigma des forschenden Umgangs mit Vergangenheit, also einer Fortbildung des Wissens zum Denken.

In his works, Bernard of Clairvaux, designed an impressive curriculum for a monastic "school of spiritual love ". Because of Bernard's remarkable level of slyle and doctrine, this curriculum was limited for centuries to a monastic elite audience. According to the article, however at the end of the ]4th century the anonymous English author of The Cloud of Unknowing (probably a Carthusian) rewrote this program with mystico-pedagogical talent and created a "democratized version" of this course - with the central metaphor (...) of a "tree of love" - thus meeting the spiritual interests and needs lay-people had in that particular period. (shrink)

This article aims principally at a reflection on the discursive reading of democracy and the democratic state of law as conceived by the German philosopher Jürgen Habermas, with a view to confront them with some sociological theories concerning democracy. In these models, Habermas seeks to identify elements that put under risk all that he understands as deliberative processes opinion formation and as the citizens will, emphasizing his model of a deliberative democracy.

We study a notion ofpartial primitive recursion (p.p.r.) including the concept ofparallelism in the context of partial continuous functions of type level one in the sense of [Krei], [Sco82], [Ers]. A variety of subrecursive hierarchies with respect top.p.r. is introduced and it turns out that they all coincide.

In einer qualitativen Interviewstudie zur Situation und zu Veränderungen in deutschen Krankenhäusern berichteten GeschäftsführerInnen und ÄrztInnen übereinstimmend von hohem und zunehmendem Druck, mittels der medizinisch-pflegerischen Leistungen Gewinne machen zu müssen. Während die GeschäftsführerInnen dabei jedoch bei patientenbezogenen ärztlichen Entscheidungen keine ethischen Konflikte sahen, berichteten ÄrztInnen von erheblichen Verletzungen des ärztlichen Ethos. Während die GeschäftsführerInnen erklärten, sie würden von den ÄrztInnen „ethisch korrektes Entscheiden“ erwarten, berichteten ÄrztInnen, dass die Rahmenbedingungen ihrer Arbeit die Unabhängigkeit ärztlicher Entscheidungen untergrüben, indem betriebswirtschaftliche Interessen die Medizin (...) korrumpierten. Entscheidungen zur stationären Aufnahme, zur Wahl der Behandlungsprozesse und zur Entlassung der PatientInnen seien in zunehmendem Maße an wirtschaftlichen Interessen des Hauses und damit nicht allein an den medizinischen Bedarfen der PatientInnen orientiert. GeschäftsführerInnen bewerteten die Unabhängigkeit ärztlicher Entscheidungen hoch, während ÄrztInnen diese als deutlich eingeschränkt bezeichneten. Die Ergebnisse verweisen auf ungelöste Konflikte zwischen Medizinethik und „Ökonomie“. Organisationsethik ist zur Vermittlung auf der Ebene der Krankenhäuser und des Gesundheitswesens insgesamt gefordert. Sie muss sich darüber hinaus mit der Wissensproduktion im Feld der Versorgungs- und Qualitätsforschung kritisch auseinandersetzen. (shrink)

It is easy to prove in ZF− that a relation R satisfies the maximal condition if and only if its transitive hull R* does; equivalently: R is well-founded if and only if R* is. We will show in the following that, if the maximal condition is replaced by the chain condition, as is often the case in Algebra, the resulting statement is not provable in ZF− anymore . More precisely, we will prove that this statement is equivalent in ZF− to (...) the countable axiom of choice ACω. Moreover, applying this result we will prove that the axiom of dependent choices, restricted to partial orders as used in Algebra, already implies the general form for arbitrary relations as formulated first by Teichmüller and, independently, some time later by Bernays and Tarski. (shrink)

We show the existence of a high r. e. degree bounding only joins of minimal pairs and of a high2 nonbounding r. e. degree. MSC: 03D25.

We will prove in Zermelo-Fraenkel set theory without axiom of choice that the transitive hull R* of a relation R is not much “bigger” than R itself. As a measure for the size of a relation we introduce the notion of κ+-narrowness using surjective Hartogs numbers rather than the usul injective Hartogs values. The main theorem of this paper states that the transitive hull of a κ+-narrow relation is κ+-narrow. As an immediate corollary we obtain that, for every infinite cardinal (...) κ, the class HCκ of all κ-hereditary sets is a set with von Neumann rank ϱ ≤ κ+. Moreover, ϱ = κ+ if and only if κ is singular, otherwise ϱ = κ. The statements of the corollary are well known in the presence of the axiom of choice . To prove them without AC - as carried through here - is, however, much harder. A special case of the corollary has been treated independently by T. JECH. (shrink)

The paper builds on both a simply typed term system ${\cal PR}^\omega$ and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion of partial primitive recursive functional on Scott domains $D_\rho$ supporting a suitable concept of parallelism. Computability on Scott domains seems to entail that Kleene's schema of higher type simultaneous course-of-values recursion (scvr) is not reducible to partial primitive recursion. So extensions ${\cal PR}^{\omega e}$ and PTWP $^e$ are studied that (...) are closed under scvr. The twist are certain type 1 Gödel recursors ${\cal R}_k$ for simultaneous partial primitive recursion. Formally, ${\cal R}_k\vec{g}\vec{H}xi$ denotes a function $f_i \in D_{\iota\to\iota}$ , however, ${\cal R}_k$ is modelled such that $f_i$ is finite, or in other words, a partial sequence. As for PTWP $^e$ , the concept of type $\iota\to\iota$ writable variables is introduced, providing the possibility of creating and manipulating partial sequences. It is shown that the PTWP $^e$ -computable functionals coincide with those definable in ${\cal PR}^{\omega e}$ plus a constant for sequential minimisation. In particular, the functionals definable in ${\cal PR}^{\omega e}$ denoted ${\cal R}^{\omega e}$ can be characterised by a subclass of PTWP $^e$ -computable functionals denoted ${\rm PPR}^{\omega e}$ . Moreover, hierarchies of strictly increasing classes ${\cal R}^{\omega e}_n$ in the style of Heinermann and complexity classes ${\rm PPR}^{\omega e}_n$ are introduced such that $\forall n\ge 0. {\cal R}^{\omega e}_n ={\rm PPR}^{\omega e}_n$ . These results extend those for ${\cal PR}^\omega$ and PTWP [Nig94]. Finally, scvr is employed to define for each type $\sigma$ the enumeration functional $E^\sigma$ of all finite elements of $D_\sigma$. (shrink)

Two simply typed term systems $\sf {PR}_1$ and $\sf {PR}_2$ are considered, both for representing algorithms computing primitive recursive functions. $\sf {PR}_1$ is based on primitive recursion, $\sf {PR}_2$ on recursion on notation. A purely syntactical method of determining the computational complexity of algorithms in $\sf {PR}_i$ , called $\mu$ -measure, is employed to uniformly integrate traditional results in subrecursion theory with resource-free characterisations of sub-elementary complexity classes. Extending the Schwichtenberg and Müller characterisation of the Grzegorczyk classes ${\mathcal{E}}_n$ for $n\ge (...) 3$ , it is shown $\mathcal{E}_{n+1} = \mathcal{R}^n_1 $ for $ n\ge 1 $, where $ \mathcal{R}^n_i$ denotes the \emph{ $n$ th modified Heinermann class} based on $\mu$ . The proof does not refer to any machine-based computation model, unlike the Schwichtenberg and Müller proofs. This is due to the notion of modified recursion lying on top of each other provided by $\mu$ . By Ritchie's result, $\mathcal{R}^1_1$ characterises the linear-space computable functions. Using the same method, a short and straightforward proof is presented, showing that $\mathcal{R}^1_2$ characterises the polynomial time computable functions. Furthermore, the classes $\mathcal{R}^n_2$ and $\mathcal{R}^n_1$ coincide at and above level 2. (shrink)

We investigate a simply typed term system ℘R ω aimed at defining partial primitive recursive functionals over arbitrary Scott domains . A hierarchy of complexity classes R n ω for functionals definable in ℘R ω is given based on a hierarchy of term classes ℘R n ωpn denoting the n th class of so-called prenormal terms . They come into play by the key observation that every term t can be transformed by what we call higher type modularization as a (...) kind of inversion of normalization into an αβη equal term t ′ having almost no structural complexity. However, it turns out that normalization of a prenormal term may increase its structural complexity with respect to the classes ℘R n ωpn , and conversely, ground type modularization being still possible may reduce it. Thus the structural complexity of a prenormal term t defined as the least n with t ϵ ℘R n ωpn depends strongly on the representation of t . We present a measure denoted μ = n rel v , ϱ for prenormal terms t to be read as t is of complexity n with valued free variables v and valued type π . It is shown that μ is stable on αβη equal terms and furthermore, μ ⩽ min {n |∃t′ ϵ ℘R n ω pn .t′ = αβη t} . Moreover, if t is in a certain μ- normal form 2, the estimate above is even true with equality, that is μ yields the structural complexity of the maximal modularization of t , clearly the best a purely structural measure can do. μ-normal forms 2 do not always exist. The counterexample we give, however, clearly shows that μ does not only take into account the structural complexity of a prenormal term but also the nature and computationl complexity of the algorithm it represents. (shrink)

We investigate a simply typed term system ℘R ω aimed at defining partial primitive recursive functionals over arbitrary Scott domains . A hierarchy of complexity classes R n ω for functionals definable in ℘R ω is given based on a hierarchy of term classes ℘R n ωpn denoting the n th class of so-called prenormal terms . They come into play by the key observation that every term t can be transformed by what we call higher type modularization as a (...) kind of inversion of normalization into an αβη equal term t ′ having almost no structural complexity. However, it turns out that normalization of a prenormal term may increase its structural complexity with respect to the classes ℘R n ωpn , and conversely, ground type modularization being still possible may reduce it. Thus the structural complexity of a prenormal term t defined as the least n with t ϵ ℘R n ωpn depends strongly on the representation of t . We present a measure denoted μ = n rel v , ϱ for prenormal terms t to be read as t is of complexity n with valued free variables v and valued type π . It is shown that μ is stable on αβη equal terms and furthermore, μ ⩽ min {n |∃t′ ϵ ℘R n ω pn .t′ = αβη t} . Moreover, if t is in a certain μ- normal form 2, the estimate above is even true with equality, that is μ yields the structural complexity of the maximal modularization of t , clearly the best a purely structural measure can do. μ-normal forms 2 do not always exist. The counterexample we give, however, clearly shows that μ does not only take into account the structural complexity of a prenormal term but also the nature and computationl complexity of the algorithm it represents. (shrink)

The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, this notion supports a rich concept of parallelism in the sense of Plotkin. The complexity of these functions is analysed by a hierarchy of classes ${\cal E}^{\bot}_n$ similar to the Grzegorczyk classes. The functions considered are characterised by a function algebra ${\cal R}^{\bot}$ generated by continuity preserving operations starting from computable initial functions. Its (...) layers ${\cal R}^{\bot}_n$ are related to those above by showing $\forall n \ge 2.{\cal E}^{\bot}_{n+1} ={\cal R}^{\bot}_n$ , thus generalising results of Schwichtenberg/Müller and Niggl. (shrink)

Religious experience can acquire plausibility within a religious tradition not only because of its "immediate giveness" but also through its objective validity and relevance. In medieval theology the doctrine of spiritual senses (sensus spiritualesj was an important locus for discussing the veracity of religious experience. The following paper examines the discourse of mystic experience in Fourteenth Century England and its historical background on the basis of the doctrine of spiritual senses - with the voices of Bonaventure, Richard Rolle, Margery Kempe, (...) Walter Hilton, Thomas Basset and the author of the Cloud of Unknowing. The theological position of the anonymous Cloud-author is of particular interest. This article suggests that the Cloud-author diagnoses a naive "mysticism experienced" as the underlying principle of some works of religious instruction. Hence the anonymous author antagonizes this experientialism with a critical epistemology, limiting the "sensational field" of mystic experience to a rather naked "cognitive nucleus". /// A experiência religiosa pode adquirir plausibilidade dentro de uma tradição religiosa não apenas por causa da sua facticidade imediata, mas também através da sua validade objectiva e relevância. Na teologia medieval, a doutrina dos sentidos espirituais (sensus spirituales) constituía um lugar importante para a discussão da veracidade da experiência religiosa. O presente artigo analisa o discurso acerca da experiência mística na Inglaterra do século XIV bem como o seu contexto histórico com base na doutrina dos sentidos espirituais, dando espaço às vozes de S. Boaventura, Richard Rolle, Margery Kempe, Walter Hilton, Thomas Basset e o autor da obra Cloud of Unknowing. Mostra-se por que razão a posição teológica do autor anónimo da Cloud of Unknowing é particularmente interessante. O artigo sugere que o autor desta importante obra diagnostica como naive o experiencialismo místico considerado como basilar a algumas obras de instrução religiosa. Daí que o autor anónimo antagonize este experiencialismo com base numa epistemologia crítica, limitando o "campo sensacional" da experiência mística a um simples "núcleo cognitivo". (shrink)

Is there still any importance of Husserl's Phenomenology for contemporary forms of philosophy of science? A comparison between Phenomenology and a prominent form of such modern philosophy of science, the so-called 'Critical Rationalism' of Karl Popper, may help to answer this question. Therefore, the different levels of argumentation have to be worked out to make the respective arguments applicable to one another. We are arguing for the following thesis: the strategy of corroboration in Critical Rationalism can be justified by (...) means of the phenomenological conception of 'intentionality of consciousness'. A typical example may illustrate how Popper's conception of taking the degree of corroboration as an indicator of the degree of verisimilitude can find its deeper foundation in Husserl's genetic interpretation of ordinary kinds of experience. (shrink)

A key problem in implicit complexity is to analyse the impact on program run times of nesting control structures, such as recursion in all finite types in functional languages or for-do statements in imperative languages.Three types of programs are studied. One type of program can only use ground type recursion. Another is concerned with imperative programs: ordinary loop programs and stack programs. Programs of the third type can use higher type recursion on notation as in functional programming languages.The present approach (...) to analysing run time yields various characterisations of fptime and all Grzegorczyk classes at and above the flinspace level. Central to this approach is the distinction between “top recursion” and “side recursion”. Top recursions are the only form of recursion which can cause an increase in complexity. Counting the depth of nested top recursions leads to several versions of “the μ-measure”. In this way, various recent solutions of key problems in implicit complexity are integrated into a uniform approach. (shrink)

The paper studies a simply typed term system Mω providing a primitive recursive concept of parallelism in the sense of Plotkin. The system aims at defining and computing partial continuous functionals. Some connections between denotational and operational semantics → for Mω are investigated. It is shown that → is correct with respect to the denotational semantics. Conversely, → is complete in the sense that if a program denotes some number k, then it is reducible to the numeral nk. Restricting to (...) the primitive recursive kernel Rω of Mω, it is shown that → is strongly normalising with uniquely determined normal forms. The twist is the design of fixed point style conversion rules for constants accounting for parallelly bounded parallel search such that correctness and strong normalisation hold. Thereupon, minor alternations to → bring about that every reduction sequence for a program of Rω terminates either in a numeral nk if the program denotes k, or in the term 0 if the program denotes the “undefined” object. Thus, Rω can be considered a primitive recursive version of Plotkin's PA+·. (shrink)

The paper builds on a simply typed term system ${\cal PR}^\omega $ providing a notion of partial primitive recursive functional on arbitrary Scott domains $D_\sigma$ that includes a suitable concept of parallelism. Computability on the partial continuous functionals seems to entail that Kleene's schema of higher type simultaneous course-of-values recursion (SCVR) is not reducible to partial primitive recursion. So an extension ${\cal PR}^{\omega e}$ is studied that is closed under SCVR and yet stays within the realm of subrecursiveness. The twist (...) are certain type 1 Gödel recursors ${\cal R}_k$ for simultaneous partial primitive recursion. Formally, the value ${\cal R}_k\vec{g}\vec{H} x i$ is a function $f_i$ of type $\iota \to \iota$ , however, ${\cal R}_k$ is modelled such that $f_i$ is a finite element of $D_{\iota\to\iota}$ or in other words, a partial sequence. It is shown that the Ackermann function is not definable in ${\cal PR}^{\omega e}$. (shrink)

The differentiation of trait anxiety and depression in nonclinical and clinical populations is addressed. Following the tripartite model, it is assumed that anxiety and depression share a large portion of negative affectivity, but differ with respect to bodily hyperarousal and anhedonia. In contrast to the tripartite model, NA is subdivided into worry and dysthymia, which leads to a four-variable model of anxiety and depression encompassing emotionality, worry, dysthymia, and anhedonia. Item-level confirmatory factor analyses and latent class cluster analysis based on (...) a large nation-wide representative German sample substantiate the construct validity of the model. Further evidence concerning convergent and discriminant validity with respect to related constructs is obtained in two smaller nonclinical and clinical samples. Factors influencing the association between components of anxiety and depression are discussed. (shrink)